We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for the so-called stable marriage problem. We complement Aldershof et al.’s (1999) analysis in two ways. First, we give an alternative and intuitive description of employment by lotto in terms of a probabilistic serial dictatorship on the set of stable matchings. Second, we show that Aldershof et al.’s (1999) conjectures are correct for small matching markets but not necessarily correct for large matching markets
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
International audienceStable matching in a community consisting of N men and N women is a classical ...
The stable matching problem is the problem of finding a stable matching between two equally sized se...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable...
We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable m...
Summary. We motivate procedural fairness for matching mechanisms and study two procedurally fair and...
Labor markets can often be viewed as many-to-one matching markets. It is well known that if compleme...
AbstractIn the theory of two-sided matching markets there are two well-known models: the marriage mo...
mechanism, a matching mechanism suggested by Roth and Vande Vate (Econome-trica 58, 1475–1480, 1990)...
Labor markets can often be viewed as many-to-one matching markets. It is well known that if compleme...
Complementarities pose problems in models of two-sided matching markets. This has been a longstandin...
It is well known that a stable matching in a many-to-one matching market with couples need not exist...
International audienceStable matching in a community consisting of men and women is a classical comb...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
International audienceStable matching in a community consisting of N men and N women is a classical ...
The stable matching problem is the problem of finding a stable matching between two equally sized se...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable...
We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable m...
Summary. We motivate procedural fairness for matching mechanisms and study two procedurally fair and...
Labor markets can often be viewed as many-to-one matching markets. It is well known that if compleme...
AbstractIn the theory of two-sided matching markets there are two well-known models: the marriage mo...
mechanism, a matching mechanism suggested by Roth and Vande Vate (Econome-trica 58, 1475–1480, 1990)...
Labor markets can often be viewed as many-to-one matching markets. It is well known that if compleme...
Complementarities pose problems in models of two-sided matching markets. This has been a longstandin...
It is well known that a stable matching in a many-to-one matching market with couples need not exist...
International audienceStable matching in a community consisting of men and women is a classical comb...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
International audienceStable matching in a community consisting of N men and N women is a classical ...
The stable matching problem is the problem of finding a stable matching between two equally sized se...